Coordinate great circle descent algorithm with application to single-index models
نویسندگان
چکیده
منابع مشابه
Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC
In this paper we propose a parallel coordinate descent algorithm for solving smooth convex optimization problems with separable constraints that may arise e.g. in distributed model predictive control (MPC) for linear network systems. Our algorithm is based on block coordinate descent updates in parallel and has a very simple iteration. We prove (sub)linear rate of convergence for the new algori...
متن کاملCoordinate Descent Optimization for l Minimization with Application to Compressed Sensing; a Greedy Algorithm
We propose a fast algorithm for solving the Basis Pursuit problem, minu{|u|1, : Au = f}, which has application to compressed sensing. We design an efficient method for solving the related unconstrained problem minu E(u) = |u|1 +λ‖Au− f‖ 2 2 based on a greedy coordinate descent method. We claim that in combination with a Bregman iterative method, our algorithm will achieve a solution with speed ...
متن کاملPenalized Bregman Divergence Estimation via Coordinate Descent
Variable selection via penalized estimation is appealing for dimension reduction. For penalized linear regression, Efron, et al. (2004) introduced the LARS algorithm. Recently, the coordinate descent (CD) algorithm was developed by Friedman, et al. (2007) for penalized linear regression and penalized logistic regression and was shown to gain computational superiority. This paper explores...
متن کاملAn Asynchronous Parallel Stochastic Coordinate Descent Algorithm
We describe an asynchronous parallel stochastic coordinate descent algorithm for minimizing smooth unconstrained or separably constrained functions. The method achieves a linear convergence rate on functions that satisfy an essential strong convexity property and a sublinear rate (1/K) on general convex functions. Near-linear speedup on a multicore system can be expected if the number of proces...
متن کاملCoordinate descent algorithm for covariance graphical lasso
Bien and Tibshirani (2011) have proposed a covariance graphical lasso method that applies a lasso penalty on the elements of the covariance matrix. This method is definitely useful because it not only produces sparse and positive definite estimates of the covariance matrix but also discovers marginal independence structures by generating exact zeros in the estimated covariance matrix. However, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics and Its Interface
سال: 2013
ISSN: 1938-7989,1938-7997
DOI: 10.4310/sii.2013.v6.n4.a9